Investigation of random-structure regular LDPC codes construction based on progressive edge-growth and algorithms for removal of short cycles

This paper investigates the construction of random-structure LDPC (low-density parity-check) codes using Progressive Edge-Growth (PEG) algorithm and two proposed algorithms for removing short cycles (CB1 CB2 algorithm; CB stands Cycle Break). is an computer-based design codes, role which to generate a Tanner graph (a bipartite graph, represents parity-check matrix error-correcting channel code) with as few possible. Short cycles, especially shortest ones length 4 edges, in graphs can degrade performance their decoding algorithm, because after certain number iterations, information sent through its edges no longer independent. The main contribution this unique approach process form erases from code's without decreasing minimum Hamming distance code. cycle-removing be used improve PEG-generated (or any other) achieved results are provided. All these were create PEG code rivals best-known similar parameters provided by one founders codes. methods generating mentioned described along simulations compare original generated processed either CB1 or also external published